computational complexity theory - PDFSEARCH.IO - Document Search Engine

computational complexity theory
Results: 2049

#	Item
931	Part III Michaelmas 2012 COMPUTATIONAL COMPLEXITY EXERCISE SHEET 1: Turing machines Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2013-10-08 12:31:35 Complexity classes Structural complexity theory Mathematical optimization Analysis of algorithms NP-complete P versus NP problem NP-hard NP Bounded-error probabilistic polynomial Theoretical computer science Computational complexity theory Applied mathematics
932	APPROXIMATION ALGORITHMS FOR COVERING AND PACKING PROBLEMS ON PATHS ARINDAM PAL DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Add to Reading List Source URL: www.cse.iitd.ernet.in Language: English - Date: 2014-01-25 10:56:26 Approximation algorithm Computational complexity theory Doctorate
933	Geosci. Model Dev., 4, 785–795, 2011 www.geosci-model-dev.netdoi:gmd © Author(sCC Attribution 3.0 License. Geoscientific Add to Reading List Source URL: www.geosci-model-dev.net Language: English - Date: 2014-12-04 04:02:00 Control theory State space Polynomial Differential equation Algorithm Computational complexity theory Derivative Function Mathematics Functions and mappings Mathematical analysis
934	BinHunt: Automatically Finding Semantic Diﬀerences in Binary Programs Debin Gao1 , Michael K. Reiter2 , and Dawn Song3 1 2 Add to Reading List Source URL: bitblaze.cs.berkeley.edu Language: English - Date: 2013-03-28 20:19:28 NP-complete problems Subgraph isomorphism problem Maximum common subgraph isomorphism problem Matching Induced subgraph isomorphism problem Graph isomorphism problem NP-complete Theoretical computer science Computational complexity theory Mathematics
935	CS581 Theory of Computation Tim Sheard Portland State University Syllabus Add to Reading List Source URL: web.cecs.pdx.edu Language: English - Date: 2013-03-29 16:45:43 Theory of computation Examinations Michael Sipser Willow Creek Homework Final examination Sheard Education Computational complexity theory Introduction to the Theory of Computation
936	Probabilistic Planning vs Replanning Iain Little and Sylvie Thi´ebaux National ICT Australia & Computer Sciences Laboratory The Australian National University Canberra, ACT 0200, Australia Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2009-07-10 09:25:03 Automated planning and scheduling Planning Domain Definition Language Motion planning NP PP Indeterminism Probability Theoretical computer science Computational complexity theory Applied mathematics
937	Fast approximation of matrix coherence and statistical leverage Petros Drineas Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NYUSA Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-08-14 00:18:31 Numerical linear algebra Matrix theory Matrices Computational complexity theory Singular value decomposition Orthogonal matrix Matrix multiplication Randomized algorithm Low-rank approximation Algebra Linear algebra Mathematics
938	Kinematic mental simulations in abduction and deduction Sangeet Suresh Khemlania,1, Robert Mackiewiczb, Monica Bucciarellic, and Philip N. Johnson-Lairdd,e,1 a Navy Center for Applied Research in Artiﬁcial Intelligence Add to Reading List Source URL: mentalmodels.princeton.edu Language: English - Date: 2013-10-01 08:19:42 Theoretical computer science Algorithm Mathematical logic Computational complexity theory Mental model Complexity NP Parallel computing Science Ethology Applied mathematics
939	Online System for Faster Multipoint Linkage Analysis via Parallel Execution on Thousands of Personal Computers M. Silberstein, A. Tzemach, N. Dovgolevsky, M. Fishelson, A. Schuster, and D. Geiger Computer Science Departm Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2011-11-09 04:50:20 Parallel computing Elston–Stewart algorithm Bayesian network Lander–Green algorithm Algorithm Genetic linkage Distributed computing Automatic parallelization Computational complexity theory Statistics Genetic epidemiology Statistical genetics
940	The EATCS Award 2015 is awarded to Christos Papadimitriou for his visionary and pioneering contributions to the development of Computer Science and its connections to the physical and applied sciences. Prof Christos H. P Add to Reading List Source URL: eatcs.org Language: English - Date: 2015-02-04 10:39:01 Christos Papadimitriou SNP PPAD NP Approximation algorithm Computational complexity theory PPA Complexity Mathematical optimization Theoretical computer science Complexity classes Applied mathematics

UPDATE